Robust Computation Tree Logic

It is widely accepted that every system should be robust in “small” violations of environment assumptions lead to guarantees, but it less clear how make this intuition mathematically precise. While significant efforts have been devoted providing notions robustness for Linear Temporal Logic (LTL), branching-time logics, such as Computation Tree (CTL) and CTL*, received attention regard. To address shortcoming, we develop “robust” extensions CTL which name (rCTL) CTL* (rCTL*). Both are syntactically similar their parent logics employ multi-valued semantics distinguish between “large” the specification. We show rCTL more expressive than CTL, while rCTL* CTL*. Moreover, devise efficient model checking algorithms rCTL*, same asymptotic time complexity respectively.